Graph homomorphism

Results: 51



#Item
41Morphisms / Graph rewriting / Graph homomorphism / Matching / Graph isomorphism / Chemical reaction / Mathematics / Graph theory / Theoretical computer science

Inferring Chemical Reaction Patterns Using Rule Composition in Graph Grammars Jakob Lykke Andersen1 , Christoph Flamm2 , Daniel Merkle1 , Peter F. Stadler2−7 1 Department for Mathematics and Computer Science, Universi

Add to Reading List

Source URL: www.tbi.univie.ac.at

Language: English - Date: 2012-11-10 11:56:10
42Graph theory / NP-complete problems / Complexity classes / Morphisms / Graph coloring / Graph homomorphism / Matching / P versus NP problem / Vertex cover / Theoretical computer science / Mathematics / Computational complexity theory

Progress on the Complexity of Counting Problems Jin-Yi Cai University of Wisconsin, Madison Asian Association for Algorithms and Computation

Add to Reading List

Source URL: pages.cs.wisc.edu

Language: English - Date: 2010-12-31 10:46:04
43Graph homomorphism / Matching / 2-satisfiability / Bipartite graph / Counting problem / Constraint satisfaction problem / Holographic algorithm / Graph / NP-complete / Theoretical computer science / Mathematics / Graph theory

Proving Dichotomy Theorems for Counting Problems Jin-Yi Cai University of Wisconsin, Madison May 30, 2009

Add to Reading List

Source URL: pages.cs.wisc.edu

Language: English - Date: 2010-12-31 10:44:44
44Graph theory / NP-complete problems / Graph coloring / Constraint programming / Complexity classes / 2-satisfiability / Graph homomorphism / NP-complete / Matching / Theoretical computer science / Mathematics / Computational complexity theory

Graph Homomorphisms with Complex Values: A Complete Dichotomy Theorem Jin-Yi Cai University of Wisconsin, Madison

Add to Reading List

Source URL: pages.cs.wisc.edu

Language: English - Date: 2011-07-14 02:22:40
45Graph theory / Computational problems / NP-complete problems / Constraint programming / Graph coloring / 2-satisfiability / NP-complete / Graph homomorphism / Constraint satisfaction problem / Theoretical computer science / Mathematics / Computational complexity theory

Dichotomy Theorems for Counting Problems Jin-Yi Cai University of Wisconsin, Madison Xi Chen Columbia University

Add to Reading List

Source URL: pages.cs.wisc.edu

Language: English - Date: 2011-07-11 20:52:11
46Graph operations / List coloring / Dominating set / Cograph / Graph / Bipartite graph / Degeneracy / Graph homomorphism / Graph theory / Graph coloring / NP-complete problems

Choosability of P5-free graphs∗ Petr A. Golovach†

Add to Reading List

Source URL: www.ii.uib.no

Language: English - Date: 2009-05-31 05:49:27
47Minor / Arboricity / Planar graph / Petersen graph / Line graph / Hamiltonian path / Neighbourhood / Clique / Graph homomorphism / Graph theory / NP-complete problems / Graph coloring

Discrete Mathematics[removed]–12 www.elsevier.com/locate/disc

Add to Reading List

Source URL: www.math.wvu.edu

Language: English - Date: 2002-03-12 13:03:16
48Szemerédi regularity lemma / Graph property / Extremal graph theory / Matching / Random graph / Graph homomorphism / Bipartite graph / Graph / Graph coloring / Graph theory / Mathematics / Theoretical computer science

Every Monotone Graph Property is Testable∗ Noga Alon

Add to Reading List

Source URL: www.math.tau.ac.il

Language: English - Date: 2005-06-15 03:13:09
49Constraint satisfaction problem / Structure / Conjunctive query / Graph homomorphism / Mathematics / Hypergraph / Morphisms

PDF Document

Add to Reading List

Source URL: www.dis.uniroma1.it

Language: English - Date: 2005-09-20 08:08:40
50Neighbourhood / Minor / Apex graph / Matching / Planar graph / Hadwiger conjecture / Graph homomorphism / Graph theory / Mathematics / Graph

PDF Document

Add to Reading List

Source URL: people.math.gatech.edu

Language: English - Date: 2004-08-20 09:09:57
UPDATE